Minimal Elimination Ordering Inside a Given Chordal Graph
نویسنده
چکیده
We consider the following problem, called Relative Minimal Elimination Ordering.
منابع مشابه
Post-Processing Elimination Orderings to Reduce Induced Width
The induced width along an elimination ordering is an important factor in the space and time complexity of many inference algorithms for graphical models. Indeed, slight changes in induced width can sometimes dictate whether a particular problem is feasible (i.e. will t in memory) using variable elimination methods. For this reason, generating low width elimination orders has received extensive...
متن کاملA wide-range algorithm for minimal triangulation from an arbitrary ordering
We present a new algorithm, called LB-Triang, which computes minimal triangulations. We give both a straightforward O(nm) time implementation and a more involved O(nm) time implementation, thus matching the best known algorithms for this problem. Our algorithm is based on a process by Lekkerkerker and Boland for recognizing chordal graphs which checks in an arbitrary order whether the minimal s...
متن کاملComputing a clique tree with algorithm MLS (Maximal Label Search)
Algorithm MLS (Maximal Label Search) is a graph search algorithm which generalizes algorithmsMCS, LexBFS, LexDFS andMNS. On a chordal graph, MLS computes a peo (perfect elimination ordering) of the graph. We show how algorithm MLS can be modified to compute a pmo (perfect moplex ordering) as well as a clique tree and the minimal separators of a chordal graph. We give a necessary and sufficient ...
متن کاملSequential Elimination Graphs
A graph is chordal if it does not contain any induced cycle of size greater than three. An alternative characterization of chordal graphs is via a perfect elimination ordering, which is an ordering of the vertices such that, for each vertex v, the neighbors of v that occur later than v in the ordering form a clique. Akcoglu et al [2] define an extension of chordal graphs whereby the neighbors o...
متن کاملParallel Gaussian Elimination with Linear Work and Fill
This paper presents an algorithm for nding parallel elimination orderings for Gaussian elimination. Viewing a system of equations as a graph, the algorithm can be applied directly to interval graphs and chordal graphs. For general graphs, the algorithm can be used to parallelize the ordering produced by some other heuristic such as minimum degree. In this case, the algorithm is applied to the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997